Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Problema investigación")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 613

  • Page / 25
Export

Selection :

  • and

Space and Time Efficient Algorithms for Planted Motif SearchDAVILA, Jaime; BALLA, Sudha; RAJASEKARAN, Sanguthevar et al.Lecture notes in computer science. 2006, pp 822-829, issn 0302-9743, isbn 3-540-34379-2, 8 p.Conference Paper

Algorithms for three-dimensional dominance searching in linear spaceMAKRIS, C; TSAKALIDIS, A.Information processing letters. 1998, Vol 66, Num 6, pp 277-283, issn 0020-0190Article

New results on intersection query problemsBOZANIS, P; KITSIOS, N; MAKRIS, C et al.Computer journal (Print). 1997, Vol 40, Num 1, pp 22-29, issn 0010-4620Article

Rendezvous search on the line with distinguishable playersALPERN, S; GAL, S.SIAM journal on control and optimization. 1995, Vol 33, Num 4, pp 1270-1276, issn 0363-0129Article

Five counterfeit coinsTOSIC, R.Journal of statistical planning and inference. 1989, Vol 22, Num 2, pp 197-202, issn 0378-3758, 6 p.Article

Optimal search for one of many objects hidden in two boxesSHARLIN, A.European journal of operational research. 1987, Vol 32, Num 2, pp 251-259, issn 0377-2217Article

Analogical reasoning based on task ontologies for on-line supportHAMAGUCHI, Takashi; YAMAZAKI, Taku; MENG HU et al.Lecture notes in computer science. 2005, issn 0302-9743, isbn 3-540-28894-5, vol1, 155-161Conference Paper

Exploiting the constrainedness in constraint satisfaction problemsSALIDO, Miguel A; BARBER, Federico.Lecture notes in computer science. 2004, pp 126-136, issn 0302-9743, isbn 3-540-22959-0, 11 p.Conference Paper

To block or not to block?ROMERO, Alejandro Gonzalez; ALQU, Rend; ZAR et al.Lecture notes in computer science. 2004, pp 134-143, issn 0302-9743, isbn 3-540-23806-9, 10 p.Conference Paper

Dynamic programming and the backpacker's linear search problemWASHBURN, A.Journal of computational and applied mathematics. 1995, Vol 60, Num 3, pp 357-365, issn 0377-0427Article

Star search: a different showKELLA, O.Israel Journal of Mathematics. 1993, Vol 81, Num 1-2, pp 145-159, issn 0021-2172Article

Continuous and discrete search for one of many objectsASSAF, D; ZAMIR, S.Operations research letters. 1987, Vol 6, Num 5, pp 205-209, issn 0167-6377Article

An empirical formula for visual searchKOOPMAN, B. O.Operations research. 1986, Vol 34, Num 3, pp 377-383, issn 0030-364XArticle

Reduction of conjugacy problem in braid groups, using two garside structuresSAMUEL, Maffre.Lecture notes in computer science. 2006, pp 189-201, issn 0302-9743, isbn 3-540-35481-6, 1Vol, 13 p.Conference Paper

Tractable decision for a constraint language implies tractable searchCOHEN, D. A.Constraints (Dordrecht). 2004, Vol 9, Num 3, pp 219-229, issn 1383-7133, 11 p.Article

Extension of Bolzano search to rectangles which preserves rectangles as iteratesTROUTT, M. D.Naval research logistics quarterly. 1987, Vol 34, Num 4, pp 593-603, issn 0028-1441Article

A predetermined algorithm for detecting a counterfeit coin with a multi-arms balanceDE BONIS, A.Discrete applied mathematics. 1998, Vol 86, Num 2-3, pp 181-200, issn 0166-218XArticle

On the short-term behaviour of genetic algorithmsBOCU, D.Yugoslav journal of operations research. 1997, Vol 7, Num 1, pp 55-63, issn 0354-0243Article

Discounted Bayesian search problems with unknown detection probabilitiesLIEBIG, T.Mathematical methods of operations research (Heidelberg). 1996, Vol 44, Num 2, pp 233-254, issn 1432-2994Article

Efficient algorithms for geometric graph search problemsIMAI, H; ASANO, T.SIAM journal on computing (Print). 1986, Vol 15, Num 2, pp 478-494, issn 0097-5397Article

Efficient preprocessing methods for quantifier eliminationBROWN, Christopher W; GROSS, Christian.Lecture notes in computer science. 2006, pp 89-100, issn 0302-9743, isbn 3-540-45182-X, 1Vol, 12 p.Conference Paper

Variable Neighborhood Search for the Orienteering ProblemSEVKLI, Zülal; SEVILGEN, F. Erdogan.Lecture notes in computer science. 2006, pp 134-143, issn 0302-9743, isbn 3-540-47242-8, 1Vol, 10 p.Conference Paper

Adaptive memory search for Boolean optimization problemsHVATTUM, Lars M; LØKKETANGEN, Arne; GLOVER, Fred et al.Discrete applied mathematics. 2004, Vol 142, Num 1-3, pp 99-109, issn 0166-218X, 11 p.Article

A group testing problem for graphs with several defective edgesJOHANN, Petra.Discrete applied mathematics. 2002, Vol 117, Num 1-3, pp 99-108, issn 0166-218XArticle

Learning search control knowledge for equational theorem provingSCHULZ, Stephan.Lecture notes in computer science. 2001, pp 320-334, issn 0302-9743, isbn 3-540-42612-4Conference Paper

  • Page / 25